The Cost of Traveling between Languages

نویسندگان

  • Michael Benedikt
  • Gabriele Puppis
  • Cristian Riveros
چکیده

We show how to calculate the maximum number of edits per character needed to convert any string in one regular language to a string in another language. Our algorithm makes use of a local determinization procedure applicable to a subclass of distance automata. We then show how to calculate the same property when the editing needs to be done in streaming fashion, by a finite state transducer, using a reduction to mean-payoff games. We show that the optimal streaming editor can be produced in PTIME.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...

متن کامل

طراحی یک سیستم کنترل فرآیند تولید برای زنجیره تامین چندمرحله‌ای و تک‌محصولی

  In a general sense, the main concept of Just-In-Time methodology is built on the concept of availability of an exact amount and type of commodity throughout a production line when it is really required. Under such circumstances, there is no need to situate any warehouse before any of the work station within the production plant. This method of manufacturing operations with the help of Kanban ...

متن کامل

A Decision Support System for Urban Journey Planning in Multimodal Public Transit Network

The goal of this paper is to develop a Decision Support System (DSS) as a journey planner in complex and large multimodal urban network called Rahyar. Rahyar attempts to identify the most desirable itinerary among all feasible alternatives. The desirability of an itinerary is measured by a disutility function, which is defined as a weighted sum of some criteria. The weight...

متن کامل

Routing and Production Scheduling for a Mobile Factory

In last decades, mobile factories have been used due to their high production capability, carrying their equipment and covering rough and uneven routes. Nowadays, more companies use mobile factories with the aim of reducing the transportation and manufacturing costs. The mobile factory must travel between the suppliers, visit all of them in each time period and return to the initial location of...

متن کامل

The Consequences of the Contacts between Bantu and Non-Bantu Languages around Lake Eyasi in Northern Tanzania

In rural Tanzania, recent major influences happen between Kiswahili and English to ethnic languages rather than ethnic languages, which had been in contact for so long, influencing each other. In this work, I report the results of investigation of lexical changes in indigenous languages that aimed at examining how ethnic communities and their languages, namely Cushitic Iraqw, Nilotic Datooga, N...

متن کامل

A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011